Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
Identifieur interne : 000006 ( LNCS/Analysis ); précédent : 000005; suivant : 000007Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
Auteurs : Anna Kasprzik [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: The area of Grammatical Inference centers on learning algorithms: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.
Url:
DOI: 10.1007/978-3-642-22321-1_45
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000796
- to stream Istex, to step Curation: 000747
- to stream Istex, to step Checkpoint: 000189
- to stream Main, to step Merge: 000A07
- to stream Main, to step Curation: 000976
- to stream Main, to step Exploration: 000976
- to stream LNCS, to step Extraction: 000006
Links to Exploration step
ISTEX:7EFE870F192FCB69B9275D35FC606D01680A819ELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7EFE870F192FCB69B9275D35FC606D01680A819E</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-22321-1_45</idno><idno type="url">https://api.istex.fr/document/7EFE870F192FCB69B9275D35FC606D01680A819E/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000796</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000796</idno><idno type="wicri:Area/Istex/Curation">000747</idno><idno type="wicri:Area/Istex/Checkpoint">000189</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000189</idno><idno type="wicri:doubleKey">0302-9743:2011:Kasprzik A:inference:of:residual</idno><idno type="wicri:Area/Main/Merge">000A07</idno><idno type="wicri:Area/Main/Curation">000976</idno><idno type="wicri:Area/Main/Exploration">000976</idno><idno type="wicri:Area/LNCS/Extraction">000006</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data</title><author><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FB IV (Theoretical Computer Science), University of Trier</wicri:regionArea><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">7EFE870F192FCB69B9275D35FC606D01680A819E</idno><idno type="DOI">10.1007/978-3-642-22321-1_45</idno><idno type="ChapterID">45</idno><idno type="ChapterID">Chap45</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The area of Grammatical Inference centers on learning algorithms: Algorithms that infer a description (e.g., a grammar or an automaton) for an unknown formal language from given information in finitely many steps. Various conceivable learning settings have been outlined, and based on those a range of algorithms have been developed. One of the language classes studied most extensively with respect to its algorithmical learnability is the class of regular string languages.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name></region><name sortKey="Kasprzik, Anna" sort="Kasprzik, Anna" uniqKey="Kasprzik A" first="Anna" last="Kasprzik">Anna Kasprzik</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000006 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000006 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:7EFE870F192FCB69B9275D35FC606D01680A819E
|texte= Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
}}
| This area was generated with Dilib version V0.6.31. |  |